Search results for "Non-uniform discrete Fourier transform"
showing 6 items of 6 documents
Localization Operators and an Uncertainty Principle for the Discrete Short Time Fourier Transform
2014
Localization operators in the discrete setting are used to obtain information on a signalffrom the knowledge on the support of its short time Fourier transform. In particular, the extremal functions of the uncertainty principle for the discrete short time Fourier transform are characterized and their connection with functions that generate a time-frequency basis is studied.
Fractional wavelet transform
1997
The wavelet transform, which has had a growing importance in signal and image processing, has been generalized by association with both the wavelet transform and the fractional Fourier transform. Possible implementations of the new transformation are in image compression, image transmission, transient signal processing, etc. Computer simulations demonstrate the abilities of the novel transform. Optical implementation of this transform is briefly discussed.
Discrete wavelet transform implementation in Fourier domain for multidimensional signal
2002
Wavelet transforms are often calculated by using the Mallat algorithm. In this algorithm, a signal is decomposed by a cascade of filtering and downsampling operations. Computing time can be important but the filtering operations can be speeded up by using fast Fourier transform (FFT)-based convolutions. Since it is necessary to work in the Fourier domain when large filters are used, we present some results of Fourier-based optimization of the sampling operations. Acceleration can be obtained by expressing the samplings in the Fourier domain. The general equations of the down- and upsampling of digital multidimensional signals are given. It is shown that for special cases such as the separab…
A Robust Wrap Reduction Algorithm for Fringe Projection Profilometry and Applications in Magnetic Resonance Imaging.
2017
In this paper, we present an effective algorithm to reduce the number of wraps in a 2D phase signal provided as input. The technique is based on an accurate estimate of the fundamental frequency of a 2D complex signal with the phase given by the input, and the removal of a dependent additive term from the phase map. Unlike existing methods based on the discrete Fourier transform (DFT), the frequency is computed by using noise-robust estimates that are not restricted to integer values. Then, to deal with the problem of a non-integer shift in the frequency domain, an equivalent operation is carried out on the original phase signal. This consists of the subtraction of a tilted plane whose slop…
Optical illustration of a varied fractional Fourier-transform order and the Radon-Wigner display.
2010
Based on an all-optical system, a display of a fractional Fourier transform with many fractional orders is proposed. Because digital image-processing terminology is used, this display is known as the Radon–Wigner transform. It enables new aspects for signal analysis that are related to time- and spatial-frequency analyses. The given approach for producing this display starts with a one-dimensional input signal although the output signal contains two dimensions. The optical setup for obtaining the fractional Fourier transform was adapted to include only fixed free-space propagation distances and variable lenses. With a set of two multifacet composite holograms, the Radon–Wigner display has b…
Fractional-Fourier-transform calculation through the fast-Fourier-transform algorithm.
1996
A method for the calculation of the fractional Fourier transform (FRT) by means of the fast Fourier transform (FFT) algorithm is presented. The process involves mainly two FFT’s in cascade; thus the process has the same complexity as this algorithm. The method is valid for fractional orders varying from −1 to 1. Scaling factors for the FRT and Fresnel diffraction when calculated through the FFT are discussed.